Extracting Minimal and Closed Monotone DNF Formulas
نویسندگان
چکیده
In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover designed by Hirata et al. (2003) with the algorithm Charm designed by Zaki and Hsiao (2002), we design the algorithm cdnf cover to extract closed monotone DNF formulas with a pruning as same as dnf cover . Finally, we implement cdnf cover and apply it to bacterial culture data.
منابع مشابه
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case strongly differs from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but checking p...
متن کاملEvaluation of DNF Formulas
We consider the Stochastic Boolean Function Evaluation (SBFE) problem for classes of DNF formulas. The SBFE problem for DNF formulas is a “sequential testing” problem where we need to determine the value of DNF formula on an initially unknown input x = (x1, ..., xn), when there is a cost ci associated with obtaining the value of xi, each xi is equal to 1 with known probability pi, and the xi ar...
متن کاملExtraction of Coverings as Monotone DNF Formulas
In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but also the maximum overlap, which is a new measure how much all pairs of two monomials in a monotone DNF formula commonly cover data. Next, we design the algorithm dnf cover to extract coverings as monotone DNF formulas satisfying ...
متن کاملComplexity of DNF minimization and isomorphism testing for monotone formulas
We investigate the complexity of finding prime implicants and minimum equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case differs strongly from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but the equiva...
متن کاملMonotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
We consider the following extremal problem: Given three natural numbers n, m and l, what is the monotone DNF formula that has a minimal or maximal number of satisfying assignments over all monotone DNF formulas on n variables with m terms each of length l? We first show that the solution to the minimization problem can be obtained by the Kruskal-Katona theorem developed in extremal set theory. ...
متن کامل